An Algorithm for Any { Time SpeechUnderstanding
نویسندگان
چکیده
This paper presents a parallel control algorithm for pattern understanding using a sematic network formalism for knowledge representation. Anytime capabilities, which are important for real world applications, are achieved by the use of iterative optimization techniques, like e.g. genetic algorithms, and the parallel processing of knowledge. First results from an application of the algorithm in the linguistic analysis of the speech understanding system Evar are given to demonstrate the feasibility of the approach.
منابع مشابه
Online Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملCooling rate optimization of as-cast consciously cast steel
Abstract: A combination of a finite element method (FEM) algorithm with ANSYS codes and post image processing of NDT ultrasonic images along with laboratory cooling experiments and microstructural analysis provide a guideline to determine the optimum cooling rate for any grade of steel in which the highest productivity can be achieved without any degradation of the cast steel products. The sugg...
متن کاملGASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment
The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...
متن کاملAn improved algorithm to reconstruct a binary tree from its inorder and postorder traversals
It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...
متن کاملA three- stage algorithm for software cost and time estimation in fuzzy environment
In this paper an efficient three- stage algorithm is developed for software production cost and time estimation. First stage includes a hybrid model composed of COCOMO and Function Points methods to increase estimation accuracy. Second stage encompasses paired comparisons matrix of analytical hierarchy process to determine amount of any resources consumed in each step of software production by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996